Institution-Based Encoding and Verification of Simple UML State Machines in CASL/SPASS

We present a new approach on how to provide institution-based semantics for UML state machines. Rather than capturing machines directly as an institution, we build up logical framework \(\mathcal {M}^{\downarrow }_{\mathcal {D}}\) into which can be embedded. A theoroidal comorphism maps the \(\textsc {Casl}\) institution. This allows symbolic reasoning By utilising heterogeneous toolset {HeTS}\) that supports {Casl}\), broad range of verification tools, including automatic theorem prover {Spass}\), combined in analysis single machine.